Bose-Chaudhari-(BCH) code
Error detecting codes in which blocks of 2m-1 bits are formed in such a way that k errors can be corrected by the inclusion of no more than mk parity bits. Typically such a code, consisting of 31-digit blocks each containing 21 message digits and 10 check digits, would be capable of detecting quadruple errors or of correcting double errors.; 一種檢錯碼,在2m-1比特傳輸位中,若所含奇偶校驗位不超過mk位,則可以校正k個差 錯。典型地,31位的塊中有21個信息位和10個校驗位,可檢查出4個差錯或校正2個差錯。